An experimental study of house allocation mechanisms

نویسندگان

  • Yan Chen
  • Tayfun Sönmez
چکیده

We report an experiment on three house allocation mechanisms under complete information: random serial dictatorship with squatting rights, and two variants of the top trading cycles mechanism. Results show that the latter two are significantly more efficient than the former. D 2004 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

House Allocation with Overlapping Agents: A Dynamic Mechanism Design Approach

Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a “newcomer” in the beginning and then becomes an “existing tenant.” Motivated by this observation, we introduce a model of house...

متن کامل

A Theory of House Allocation and Exchange Mechanisms∗

We study the allocation and exchange of indivisible objects without monetary transfers. In market design literature, some problems that fall in this category are the house allocation problem with and without existing tenants, and the kidney exchange problem. We introduce a new class of direct mechanisms that we call "trading cycles with brokers and owners," and show that (i) each mechanism in t...

متن کامل

House allocation with existing tenants: an equivalence

In this paper we analyze two house allocation mechanisms each of which is designed to eliminate inefficiencies in real-life house allocation problems where there are both existing tenants and newcomers. The Þrst mechanism chooses the unique core allocation of a “sister” exchange economy which is constructed by assigning each existing tenant her current house and randomly assigning each newcomer...

متن کامل

An Equivalence result in School Choice

The main result of the paper is a proof of the equivalence of single and multiple lottery mechanisms for the problem of allocating students to schools in which students have strict preferences and the schools are indifferent. This solves a recent open problem proposed by Pathak, who was motivated by the practical problem of assigning students to high schools in New York City. In proving this re...

متن کامل

Serial dictatorship: The unique optimal allocation rule when information is endogenous

The study of matching problems typically assumes that agents precisely know their preferences over the goods to be assigned. Within applied contexts, this assumption stands out as particularly counterfactual. Parents typically do invest a large amount of time and resources to find the best school for their children; doctors run costly tests to establish the best kidney for a given patient. In t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999